Sequential maximum likelihood decoding incorporating reliability determination for image sensor communication
نویسندگان
چکیده
منابع مشابه
Maximum likelihood estimation for cooperative sequential adsorption
We consider a model for a time series of spatial locations, in which points are placed sequentially at random into an initially empty region of R, and given the current configuration of points, the likelihood at location x for the next particle is proportional to a specified function βk of the current number (k) of points within a specified distance of x. We show that the maximum likelihood est...
متن کاملMaximum-Likelihood Image Matching
ÐImage matching applications such as tracking and stereo commonly use the sum-of-squared-difference (SSD) measure to determine the best match. However, this measure is sensitive to outliers and is not robust to template variations. Alternative measures have also been proposed that are more robust to these issues. We improve upon these using a probabilistic formulation for image matching in term...
متن کاملThe Maximum-Likelihood Soft-Decision Sequential Decoding Algorithms for Convolutional Codes
In this thesis, we study the performance of the maximum-likelihood soft-decision sequential decoding algorithm (MLSDA) for convolutional codes, which is previously proposed in [1]. Instead of using the conventional Fano metric, the proposed algorithm employs a new metric based on a variation of the Wagner rule, which is referred to as the second form of the maximum-likelihood decoding rule. The...
متن کاملFast Algorithm for Generating Candidate Codewords in Reliability-Based Maximum Likelihood Decoding
We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. I...
متن کاملEllipsoidal lists and maximum-likelihood decoding
We study an interrelation between the coverings generated by linear ( )–codes and complexity of their maximum-likelihood (ML) decoding. First, discrete ellipsoids in the Hamming spaces are introduced. These ellipsoids represent the sets of most probable error patterns that need to be tested in soft-decision ML decoding. We show that long linear ( )-codes surrounded by ellipsoids of exponential ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Communications Express
سال: 2020
ISSN: 2187-0136
DOI: 10.1587/comex.2020xbl0058